Best rank-k approximations for tensors: generalizing Eckart–Young
نویسندگان
چکیده
منابع مشابه
Complex Tensors Almost Always Have Best Low-rank Approximations
Low-rank tensor approximations are plagued by a well-known problem — a tensor may fail to have a best rank-r approximation. Over R, it is known that such failures can occur with positive probability, sometimes with certainty: in R2×2×2, every tensor of rank 3 fails to have a best rank-2 approximation. We will show that while such failures still occur over C, they happen with zero probability. I...
متن کاملOn best rank one approximation of tensors
Today, compact and reduced data representations using low rank data approximation are common to represent high-dimensional data sets in many application areas as for example genomics, multimedia, quantum chemistry, social networks or visualization. In order to produce such low rank data representations, the input data is typically approximated by so-called alternating least squares (ALS) algori...
متن کاملSuccessive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing inspiration from the matrix case, the successive rank-one approximations (SROA) scheme has been proposed and shown to yield this tensor decomposition exactly, an...
متن کاملOn best rank n matrix approximations
Article history: Received 31 October 2011 Accepted 15 May 2012 Available online 28 June 2012 Submitted by Volker Mehrmann AMS classification: 15A60 15B48 15A03
متن کاملEla Fast Low Rank Approximations of Matrices and Tensors
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given m × n matrix A by a matrix B of rank at most k which is much smaller than m and n. The best rank k approximation can be determined via the singular value decomposition which, however, has prohibitively high computational complexity and storage requirements for very large m and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in the Mathematical Sciences
سال: 2018
ISSN: 2522-0144,2197-9847
DOI: 10.1007/s40687-018-0145-1